Neighbour isolated scattering number of graphs
نویسندگان
چکیده
منابع مشابه
Neighbour isolated scattering number of graphs
The scattering number is a measure of the vulnerability of a graph. In this paper we investigate a refinement that involves the neighbour isolated version of the parameter. The neighbour isolated scattering number of a noncomplete graph G is defined to be NIS(G) =max{i(G/X )−|X | : i(G/X )3⁄4 1} where the maximum is taken over all X , the cut strategy of G, and i(G/X ) is the number of componen...
متن کاملOn the fixed number of graphs
A set of vertices $S$ of a graph $G$ is called a fixing set of $G$, if only the trivial automorphism of $G$ fixes every vertex in $S$. The fixing number of a graph is the smallest cardinality of a fixing set. The fixed number of a graph $G$ is the minimum $k$, such that every $k$-set of vertices of $G$ is a fixing set of $G$. A graph $G$ is called a $k$-fixed graph, if its fix...
متن کاملOn the saturation number of graphs
Let $G=(V,E)$ be a simple connected graph. A matching $M$ in a graph $G$ is a collection of edges of $G$ such that no two edges from $M$ share a vertex. A matching $M$ is maximal if it cannot be extended to a larger matching in $G$. The cardinality of any smallest maximal matching in $G$ is the saturation number of $G$ and is denoted by $s(G)$. In this paper we study the saturation numbe...
متن کاملOn Open Packing Number of Graphs
In a graph G = (V,E), a subset $S⊂V$ is said to be an open packing set if no two vertices of S have a common neighbour in G. The maximum cardinality of an open packing set is called the open packing number and is denoted by $ρ^{o}$. This paper further studies on this parameter by obtaining some new bounds.
متن کاملOn graphs isomorphic to their neighbour and non-neighbour sets
The paper contains a construction of a universal countable graph, different from the Rado graph, such that for any of its vertices both the neighbourhood and the non-neighbourhood induce subgraphs isomorphic to the whole graph. This solves an open problem proposed by A. Bonato; see Problem 20 in [5]. We supply a construction of several non-isomorphic graphs with the property, and consider tourn...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ScienceAsia
سال: 2015
ISSN: 1513-1874
DOI: 10.2306/scienceasia1513-1874.2015.41.423